Optimistic Planning for the Stochastic Knapsack Problem
نویسندگان
چکیده
(a) A policy of just playing item 3. This policy has depth 1. (b) A policy that plays item 2 first. If it is small, it plays item 1 whereas if it is large it plays item 3. After this, the final item is determined due to the fact that there are only 3 items in the problem. This policy has depth 2. Figure 4: Examples of policies in the simple 3 item, 2 sizes stochastic knapsack problem. Each blue line represents choosing an item and the red lines represent the sizes of the previous items.
منابع مشابه
Gaussian Process Based Optimistic Knapsack Sampling with Applications to Stochastic Resource Allocation
The stochastic non-linear fractional knapsack problem is a challenging optimization problem with numerous applications, including resource allocation. The goal is to find the most valuable mix of materials that fits within a knapsack of fixed capacity. When the value functions of the involved materials are fully known and differentiable, the most valuable mixture can be found by direct applicat...
متن کاملSolving a bi-objective project capital budgeting problem using a fuzzy multi-dimensional knapsack
In this paper, the researchers have proposed a multi-dimensional knapsack model for project capital budgeting problem in uncertain situation which has been modeled through fuzzy sets. The optimistic and pessimistic situations were considered and associated deterministic models were yielded. Numerical example has been supplied toillustrate the performance of proposed model. The results were prom...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملA (2 + )-Approximation Algorithm for the Stochastic Knapsack Problem
The stochastic knapsack problem is a natural generalization of classical knapsack problem. In this problem, we are given a set of items each associated with a probability distribution on sizes and a profit, and a knapsack of unit capacity. The size of an item is unknown before inserting it into the knapsack, and it is revealed as soon as the item inserted into the knapsack. The objective is to ...
متن کامل